Start control of an M 3 C‐based FFTS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

Efficient Calculations of 3-D FFTs on Spiral Contours

This paper proposes a fast algorithm, called the SpiralFFT, that computes samples of the 3-D discrete Fourier transform of an object of interest along spiral contours in frequency space. This type of sampling geometry is prevalent in 3-D magnetic resonance imaging, as spiral sampling patterns allow for rapid, uninterrupted scanning over a large range of frequencies. We show that parameterizing ...

متن کامل

FFTS ON THE VPP 500 3 Platform FFT performance rFFT

Fast Fourier transforms parallelize well but need large amounts of communication. An algorithm which concentrates all the communication in one or two transposition steps is the transpose split algorithm. Di erent transposition algorithms can be used depending on data size and communication latency. A new transpose split algorithm for real and hermitian data is presented for one, two and three d...

متن کامل

Multiprocessor FFTs

Several multiprocessor FFTs are developed in this paper for both vector multiprocessors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an ordered transform and have a stride of one except for a single "link" step. Since multiple FFTs provide additional options for both vectorization and distribution we show that a single FFT can be performed in ...

متن کامل

Symmetric FFTs

In this paper, we examine the FFT of sequences x„ = xN + „ with period N that satisfy certain symmetric relations. It is known that one can take advantage of these relations in order to reduce the computing time required by the FFT. For example, the time required for the FFT of a real sequence is about half that required for the FFT of a complex sequence. Also, the time required for the FFT of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Engineering

سال: 2018

ISSN: 2051-3305,2051-3305

DOI: 10.1049/joe.2018.8401